منابع مشابه
Wide Diameters of (n, k)-Star Graphs
An (n, k)-star graph (Sn,k) refers to a generalized version of an n-star graph (Sn), where Sn,n−1 and Sn are isomorphic and Sn,1 is obviously a complete graph of n vertices (Kn). Since Lin et al. (2004) already calculated the wide diameters in (n, n−1)-star and (n, 1)-star graphs, this study only considers an Sn,k with 2≤k≤n−2. Lin et al. (2008) also computed upper and lower bounds of the wide ...
متن کاملWide diameters of de Bruijn graphs
The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undirected graph UB(d,n), there are 2d − 2 internally disjoint paths of length at most 2n + 1. Therefore, the (2d − 2)-wide diameter of UB(d,n) is not greater than 2n+ 1.
متن کاملExtended Butterfly Networks
This paper defines a new network called the Extended Butterfly. The extended butterfly of degree n (XBn) has n 2 nodes, diameter equal to b3n/2c and a constant node degree of 8. XBn is symmetric and contains n distinct copies of Bn. We also show that XBn supports all cycle subgraphs except those of odd lengths when n is even and of odd lengths less than n.
متن کاملRabin numbers of Butterfly networks
Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the w-wide diameter d,(G), the (W 1 )-fault diameter D,,(G), and the w-Rabin number r,(G) have been used to measure network reliability and efficiency. In this paper, we study these parameters for an important class of parallel networks Butterfly networks. The main result of this paper is to d...
متن کاملGeneralized Diameters and Rabin Numbers of Networks
Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the w-wide diameter dw(G), the (w − 1)-fault diameter Dw(G), and the w-Rabin number rw(G) have been used to measure network reliability and efficiency. In this paper, we study dw(G), Dw(G) and rw(G) using the strong w-Rabin number r∗ w(G) for 1 ≤ w ≤ k(G) and G is a circulant network G(dn; {1,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 1999
ISSN: 1027-5487
DOI: 10.11650/twjm/1500407056